Typed Kleene Algebra with Products and Iteration Theories
نویسندگان
چکیده
We develop a typed equational system that subsumes both iteration theories and typed Kleene algebra in a common framework. Our approach is based on cartesian categories endowed with commutative strong monads to handle nondeterminism.
منابع مشابه
Kleene Algebra with Products and Iteration Theories
We develop a typed equational system that subsumes both iteration theories and typed Kleene algebra in a common framework. Our approach is based on cartesian categories endowed with commutative strong monads to handle nondeterminism. 1998 ACM Subject Classification F.3.1 Specifying and Verifying and Reasoning about Programs
متن کاملTyping theorems of omega algebra
Typed omega algebras extend Kozen’s typed Kleene algebras by an operation for infinite iteration in a similar way as Cohen’s omega algebras extend Kleene algebras in the untyped case. Typing these algebras is motivated by non-square matrices in automata constructions and applications in program semantics. For several reasons – the theory of untyped (Kleene or omega) algebras is well developed, ...
متن کاملTowards a Typed Omega Algebra
We propose axioms for 1-free omega algebra, typed 1-free omega algebra and typed omega algebra. They are based on Kozen’s axioms for 1-free and typed Kleene algebra and Cohen’s axioms for the omega operation. In contrast to Kleene algebra, several laws of omega algebra turn into independent axioms in the typed or 1-free variants. We set up a matrix algebra over typed 1-free omega algebras by li...
متن کاملKleene Monads: Handling Iteration in a Framework of Generic Effects
Monads are a well-established tool for modelling various computational effects. They form the semantic basis of Moggi’s computational metalanguage, the metalanguage of effects for short, which made its way into modern functional programming in the shape of Haskell’s do-notation. Standard computational idioms call for specific classes of monads that support additional control operations. Here, w...
متن کاملSome Applications of Kleene Algebra
We will treat some application by using Kleene algebra and its properties. First, We will find the shortest path which links two given vertices in a directed (finite) graph. Also, we will give an algorithm to solve this problem by using the typed Kleene algebra. Finally, we use Kleene algebra to put any program in while free form.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2013